The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(2^n, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

a__minus(0, Y) → 0
a__minus(s(X), s(Y)) → a__minus(X, Y)
a__geq(X, 0) → true
a__geq(0, s(Y)) → false
a__geq(s(X), s(Y)) → a__geq(X, Y)
a__div(0, s(Y)) → 0
a__div(s(X), s(Y)) → a__if(a__geq(X, Y), s(div(minus(X, Y), s(Y))), 0)
a__if(true, X, Y) → mark(X)
a__if(false, X, Y) → mark(Y)
mark(minus(X1, X2)) → a__minus(X1, X2)
mark(geq(X1, X2)) → a__geq(X1, X2)
mark(div(X1, X2)) → a__div(mark(X1), X2)
mark(if(X1, X2, X3)) → a__if(mark(X1), X2, X3)
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(true) → true
mark(false) → false
a__minus(X1, X2) → minus(X1, X2)
a__geq(X1, X2) → geq(X1, X2)
a__div(X1, X2) → div(X1, X2)
a__if(X1, X2, X3) → if(X1, X2, X3)

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(2ⁿ):
The rewrite sequence
mark(div(s(X834528_4), s(Y835042_4))) →⁺ a__if(a__geq(mark(X834528_4), Y835042_4), s(div(minus(mark(X834528_4), Y835042_4), s(Y835042_4))), 0)
gives rise to a decreasing loop by considering the right hand sides subterm at position [0,0].
The pumping substitution is [X834528_4 / div(s(X834528_4), s(Y835042_4))].
The result substitution is [ ].

The rewrite sequence
mark(div(s(X834528_4), s(Y835042_4))) →⁺ a__if(a__geq(mark(X834528_4), Y835042_4), s(div(minus(mark(X834528_4), Y835042_4), s(Y835042_4))), 0)
gives rise to a decreasing loop by considering the right hand sides subterm at position [1,0,0,0].
The pumping substitution is [X834528_4 / div(s(X834528_4), s(Y835042_4))].
The result substitution is [ ].

(2) BOUNDS(2^n, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

a__minus(0', Y) → 0'
a__minus(s(X), s(Y)) → a__minus(X, Y)
a__geq(X, 0') → true
a__geq(0', s(Y)) → false
a__geq(s(X), s(Y)) → a__geq(X, Y)
a__div(0', s(Y)) → 0'
a__div(s(X), s(Y)) → a__if(a__geq(X, Y), s(div(minus(X, Y), s(Y))), 0')
a__if(true, X, Y) → mark(X)
a__if(false, X, Y) → mark(Y)
mark(minus(X1, X2)) → a__minus(X1, X2)
mark(geq(X1, X2)) → a__geq(X1, X2)
mark(div(X1, X2)) → a__div(mark(X1), X2)
mark(if(X1, X2, X3)) → a__if(mark(X1), X2, X3)
mark(0') → 0'
mark(s(X)) → s(mark(X))
mark(true) → true
mark(false) → false
a__minus(X1, X2) → minus(X1, X2)
a__geq(X1, X2) → geq(X1, X2)
a__div(X1, X2) → div(X1, X2)
a__if(X1, X2, X3) → if(X1, X2, X3)

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
a__minus(0', Y) → 0'
a__minus(s(X), s(Y)) → a__minus(X, Y)
a__geq(X, 0') → true
a__geq(0', s(Y)) → false
a__geq(s(X), s(Y)) → a__geq(X, Y)
a__div(0', s(Y)) → 0'
a__div(s(X), s(Y)) → a__if(a__geq(X, Y), s(div(minus(X, Y), s(Y))), 0')
a__if(true, X, Y) → mark(X)
a__if(false, X, Y) → mark(Y)
mark(minus(X1, X2)) → a__minus(X1, X2)
mark(geq(X1, X2)) → a__geq(X1, X2)
mark(div(X1, X2)) → a__div(mark(X1), X2)
mark(if(X1, X2, X3)) → a__if(mark(X1), X2, X3)
mark(0') → 0'
mark(s(X)) → s(mark(X))
mark(true) → true
mark(false) → false
a__minus(X1, X2) → minus(X1, X2)
a__geq(X1, X2) → geq(X1, X2)
a__div(X1, X2) → div(X1, X2)
a__if(X1, X2, X3) → if(X1, X2, X3)

Types:
a__minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
0' :: 0':s:true:false:minus:div:geq:if
s :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
true :: 0':s:true:false:minus:div:geq:if
false :: 0':s:true:false:minus:div:geq:if
a__div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
mark :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
hole_0':s:true:false:minus:div:geq:if1_0 :: 0':s:true:false:minus:div:geq:if
gen_0':s:true:false:minus:div:geq:if2_0 :: Nat → 0':s:true:false:minus:div:geq:if

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
a__minus, a__geq, mark

They will be analysed ascendingly in the following order:
a__minus < mark
a__geq < mark

(8) Obligation:

TRS:
Rules:
a__minus(0', Y) → 0'
a__minus(s(X), s(Y)) → a__minus(X, Y)
a__geq(X, 0') → true
a__geq(0', s(Y)) → false
a__geq(s(X), s(Y)) → a__geq(X, Y)
a__div(0', s(Y)) → 0'
a__div(s(X), s(Y)) → a__if(a__geq(X, Y), s(div(minus(X, Y), s(Y))), 0')
a__if(true, X, Y) → mark(X)
a__if(false, X, Y) → mark(Y)
mark(minus(X1, X2)) → a__minus(X1, X2)
mark(geq(X1, X2)) → a__geq(X1, X2)
mark(div(X1, X2)) → a__div(mark(X1), X2)
mark(if(X1, X2, X3)) → a__if(mark(X1), X2, X3)
mark(0') → 0'
mark(s(X)) → s(mark(X))
mark(true) → true
mark(false) → false
a__minus(X1, X2) → minus(X1, X2)
a__geq(X1, X2) → geq(X1, X2)
a__div(X1, X2) → div(X1, X2)
a__if(X1, X2, X3) → if(X1, X2, X3)

Types:
a__minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
0' :: 0':s:true:false:minus:div:geq:if
s :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
true :: 0':s:true:false:minus:div:geq:if
false :: 0':s:true:false:minus:div:geq:if
a__div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
mark :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
hole_0':s:true:false:minus:div:geq:if1_0 :: 0':s:true:false:minus:div:geq:if
gen_0':s:true:false:minus:div:geq:if2_0 :: Nat → 0':s:true:false:minus:div:geq:if

Generator Equations:
gen_0':s:true:false:minus:div:geq:if2_0(0) ⇔ 0'
gen_0':s:true:false:minus:div:geq:if2_0(+(x, 1)) ⇔ s(gen_0':s:true:false:minus:div:geq:if2_0(x))

The following defined symbols remain to be analysed:
a__minus, a__geq, mark

They will be analysed ascendingly in the following order:
a__minus < mark
a__geq < mark

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(n4_0), gen_0':s:true:false:minus:div:geq:if2_0(n4_0)) → gen_0':s:true:false:minus:div:geq:if2_0(0), rt ∈ Ω(1 + n4₀)

Induction Base:
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(0), gen_0':s:true:false:minus:div:geq:if2_0(0)) →_R^Ω(1)
0'

Induction Step:
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(+(n4_0, 1)), gen_0':s:true:false:minus:div:geq:if2_0(+(n4_0, 1))) →_R^Ω(1)
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(n4_0), gen_0':s:true:false:minus:div:geq:if2_0(n4_0)) →_IH
gen_0':s:true:false:minus:div:geq:if2_0(0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(10) Complex Obligation (BEST)

(11) Obligation:

TRS:
Rules:
a__minus(0', Y) → 0'
a__minus(s(X), s(Y)) → a__minus(X, Y)
a__geq(X, 0') → true
a__geq(0', s(Y)) → false
a__geq(s(X), s(Y)) → a__geq(X, Y)
a__div(0', s(Y)) → 0'
a__div(s(X), s(Y)) → a__if(a__geq(X, Y), s(div(minus(X, Y), s(Y))), 0')
a__if(true, X, Y) → mark(X)
a__if(false, X, Y) → mark(Y)
mark(minus(X1, X2)) → a__minus(X1, X2)
mark(geq(X1, X2)) → a__geq(X1, X2)
mark(div(X1, X2)) → a__div(mark(X1), X2)
mark(if(X1, X2, X3)) → a__if(mark(X1), X2, X3)
mark(0') → 0'
mark(s(X)) → s(mark(X))
mark(true) → true
mark(false) → false
a__minus(X1, X2) → minus(X1, X2)
a__geq(X1, X2) → geq(X1, X2)
a__div(X1, X2) → div(X1, X2)
a__if(X1, X2, X3) → if(X1, X2, X3)

Types:
a__minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
0' :: 0':s:true:false:minus:div:geq:if
s :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
true :: 0':s:true:false:minus:div:geq:if
false :: 0':s:true:false:minus:div:geq:if
a__div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
mark :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
hole_0':s:true:false:minus:div:geq:if1_0 :: 0':s:true:false:minus:div:geq:if
gen_0':s:true:false:minus:div:geq:if2_0 :: Nat → 0':s:true:false:minus:div:geq:if

Lemmas:
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(n4_0), gen_0':s:true:false:minus:div:geq:if2_0(n4_0)) → gen_0':s:true:false:minus:div:geq:if2_0(0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s:true:false:minus:div:geq:if2_0(0) ⇔ 0'
gen_0':s:true:false:minus:div:geq:if2_0(+(x, 1)) ⇔ s(gen_0':s:true:false:minus:div:geq:if2_0(x))

The following defined symbols remain to be analysed:
a__geq, mark

They will be analysed ascendingly in the following order:
a__geq < mark

(12) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
a__geq(gen_0':s:true:false:minus:div:geq:if2_0(n491_0), gen_0':s:true:false:minus:div:geq:if2_0(n491_0)) → true, rt ∈ Ω(1 + n491₀)

Induction Base:
a__geq(gen_0':s:true:false:minus:div:geq:if2_0(0), gen_0':s:true:false:minus:div:geq:if2_0(0)) →_R^Ω(1)
true

Induction Step:
a__geq(gen_0':s:true:false:minus:div:geq:if2_0(+(n491_0, 1)), gen_0':s:true:false:minus:div:geq:if2_0(+(n491_0, 1))) →_R^Ω(1)
a__geq(gen_0':s:true:false:minus:div:geq:if2_0(n491_0), gen_0':s:true:false:minus:div:geq:if2_0(n491_0)) →_IH
true

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(13) Complex Obligation (BEST)

(14) Obligation:

TRS:
Rules:
a__minus(0', Y) → 0'
a__minus(s(X), s(Y)) → a__minus(X, Y)
a__geq(X, 0') → true
a__geq(0', s(Y)) → false
a__geq(s(X), s(Y)) → a__geq(X, Y)
a__div(0', s(Y)) → 0'
a__div(s(X), s(Y)) → a__if(a__geq(X, Y), s(div(minus(X, Y), s(Y))), 0')
a__if(true, X, Y) → mark(X)
a__if(false, X, Y) → mark(Y)
mark(minus(X1, X2)) → a__minus(X1, X2)
mark(geq(X1, X2)) → a__geq(X1, X2)
mark(div(X1, X2)) → a__div(mark(X1), X2)
mark(if(X1, X2, X3)) → a__if(mark(X1), X2, X3)
mark(0') → 0'
mark(s(X)) → s(mark(X))
mark(true) → true
mark(false) → false
a__minus(X1, X2) → minus(X1, X2)
a__geq(X1, X2) → geq(X1, X2)
a__div(X1, X2) → div(X1, X2)
a__if(X1, X2, X3) → if(X1, X2, X3)

Types:
a__minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
0' :: 0':s:true:false:minus:div:geq:if
s :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
true :: 0':s:true:false:minus:div:geq:if
false :: 0':s:true:false:minus:div:geq:if
a__div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
mark :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
hole_0':s:true:false:minus:div:geq:if1_0 :: 0':s:true:false:minus:div:geq:if
gen_0':s:true:false:minus:div:geq:if2_0 :: Nat → 0':s:true:false:minus:div:geq:if

Lemmas:
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(n4_0), gen_0':s:true:false:minus:div:geq:if2_0(n4_0)) → gen_0':s:true:false:minus:div:geq:if2_0(0), rt ∈ Ω(1 + n4₀)
a__geq(gen_0':s:true:false:minus:div:geq:if2_0(n491_0), gen_0':s:true:false:minus:div:geq:if2_0(n491_0)) → true, rt ∈ Ω(1 + n491₀)

Generator Equations:
gen_0':s:true:false:minus:div:geq:if2_0(0) ⇔ 0'
gen_0':s:true:false:minus:div:geq:if2_0(+(x, 1)) ⇔ s(gen_0':s:true:false:minus:div:geq:if2_0(x))

The following defined symbols remain to be analysed:
mark

(15) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
mark(gen_0':s:true:false:minus:div:geq:if2_0(n1104_0)) → gen_0':s:true:false:minus:div:geq:if2_0(n1104_0), rt ∈ Ω(1 + n1104₀)

Induction Base:
mark(gen_0':s:true:false:minus:div:geq:if2_0(0)) →_R^Ω(1)
0'

Induction Step:
mark(gen_0':s:true:false:minus:div:geq:if2_0(+(n1104_0, 1))) →_R^Ω(1)
s(mark(gen_0':s:true:false:minus:div:geq:if2_0(n1104_0))) →_IH
s(gen_0':s:true:false:minus:div:geq:if2_0(c1105_0))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(16) Complex Obligation (BEST)

(17) Obligation:

TRS:
Rules:
a__minus(0', Y) → 0'
a__minus(s(X), s(Y)) → a__minus(X, Y)
a__geq(X, 0') → true
a__geq(0', s(Y)) → false
a__geq(s(X), s(Y)) → a__geq(X, Y)
a__div(0', s(Y)) → 0'
a__div(s(X), s(Y)) → a__if(a__geq(X, Y), s(div(minus(X, Y), s(Y))), 0')
a__if(true, X, Y) → mark(X)
a__if(false, X, Y) → mark(Y)
mark(minus(X1, X2)) → a__minus(X1, X2)
mark(geq(X1, X2)) → a__geq(X1, X2)
mark(div(X1, X2)) → a__div(mark(X1), X2)
mark(if(X1, X2, X3)) → a__if(mark(X1), X2, X3)
mark(0') → 0'
mark(s(X)) → s(mark(X))
mark(true) → true
mark(false) → false
a__minus(X1, X2) → minus(X1, X2)
a__geq(X1, X2) → geq(X1, X2)
a__div(X1, X2) → div(X1, X2)
a__if(X1, X2, X3) → if(X1, X2, X3)

Types:
a__minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
0' :: 0':s:true:false:minus:div:geq:if
s :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
true :: 0':s:true:false:minus:div:geq:if
false :: 0':s:true:false:minus:div:geq:if
a__div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
mark :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
hole_0':s:true:false:minus:div:geq:if1_0 :: 0':s:true:false:minus:div:geq:if
gen_0':s:true:false:minus:div:geq:if2_0 :: Nat → 0':s:true:false:minus:div:geq:if

Lemmas:
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(n4_0), gen_0':s:true:false:minus:div:geq:if2_0(n4_0)) → gen_0':s:true:false:minus:div:geq:if2_0(0), rt ∈ Ω(1 + n4₀)
a__geq(gen_0':s:true:false:minus:div:geq:if2_0(n491_0), gen_0':s:true:false:minus:div:geq:if2_0(n491_0)) → true, rt ∈ Ω(1 + n491₀)
mark(gen_0':s:true:false:minus:div:geq:if2_0(n1104_0)) → gen_0':s:true:false:minus:div:geq:if2_0(n1104_0), rt ∈ Ω(1 + n1104₀)

Generator Equations:
gen_0':s:true:false:minus:div:geq:if2_0(0) ⇔ 0'
gen_0':s:true:false:minus:div:geq:if2_0(+(x, 1)) ⇔ s(gen_0':s:true:false:minus:div:geq:if2_0(x))

No more defined symbols left to analyse.

(18) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(n4_0), gen_0':s:true:false:minus:div:geq:if2_0(n4_0)) → gen_0':s:true:false:minus:div:geq:if2_0(0), rt ∈ Ω(1 + n4₀)

(19) BOUNDS(n^1, INF)

(20) Obligation:

TRS:
Rules:
a__minus(0', Y) → 0'
a__minus(s(X), s(Y)) → a__minus(X, Y)
a__geq(X, 0') → true
a__geq(0', s(Y)) → false
a__geq(s(X), s(Y)) → a__geq(X, Y)
a__div(0', s(Y)) → 0'
a__div(s(X), s(Y)) → a__if(a__geq(X, Y), s(div(minus(X, Y), s(Y))), 0')
a__if(true, X, Y) → mark(X)
a__if(false, X, Y) → mark(Y)
mark(minus(X1, X2)) → a__minus(X1, X2)
mark(geq(X1, X2)) → a__geq(X1, X2)
mark(div(X1, X2)) → a__div(mark(X1), X2)
mark(if(X1, X2, X3)) → a__if(mark(X1), X2, X3)
mark(0') → 0'
mark(s(X)) → s(mark(X))
mark(true) → true
mark(false) → false
a__minus(X1, X2) → minus(X1, X2)
a__geq(X1, X2) → geq(X1, X2)
a__div(X1, X2) → div(X1, X2)
a__if(X1, X2, X3) → if(X1, X2, X3)

Types:
a__minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
0' :: 0':s:true:false:minus:div:geq:if
s :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
true :: 0':s:true:false:minus:div:geq:if
false :: 0':s:true:false:minus:div:geq:if
a__div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
mark :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
hole_0':s:true:false:minus:div:geq:if1_0 :: 0':s:true:false:minus:div:geq:if
gen_0':s:true:false:minus:div:geq:if2_0 :: Nat → 0':s:true:false:minus:div:geq:if

Lemmas:
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(n4_0), gen_0':s:true:false:minus:div:geq:if2_0(n4_0)) → gen_0':s:true:false:minus:div:geq:if2_0(0), rt ∈ Ω(1 + n4₀)
a__geq(gen_0':s:true:false:minus:div:geq:if2_0(n491_0), gen_0':s:true:false:minus:div:geq:if2_0(n491_0)) → true, rt ∈ Ω(1 + n491₀)
mark(gen_0':s:true:false:minus:div:geq:if2_0(n1104_0)) → gen_0':s:true:false:minus:div:geq:if2_0(n1104_0), rt ∈ Ω(1 + n1104₀)

Generator Equations:
gen_0':s:true:false:minus:div:geq:if2_0(0) ⇔ 0'
gen_0':s:true:false:minus:div:geq:if2_0(+(x, 1)) ⇔ s(gen_0':s:true:false:minus:div:geq:if2_0(x))

No more defined symbols left to analyse.

(21) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(n4_0), gen_0':s:true:false:minus:div:geq:if2_0(n4_0)) → gen_0':s:true:false:minus:div:geq:if2_0(0), rt ∈ Ω(1 + n4₀)

(22) BOUNDS(n^1, INF)

(23) Obligation:

TRS:
Rules:
a__minus(0', Y) → 0'
a__minus(s(X), s(Y)) → a__minus(X, Y)
a__geq(X, 0') → true
a__geq(0', s(Y)) → false
a__geq(s(X), s(Y)) → a__geq(X, Y)
a__div(0', s(Y)) → 0'
a__div(s(X), s(Y)) → a__if(a__geq(X, Y), s(div(minus(X, Y), s(Y))), 0')
a__if(true, X, Y) → mark(X)
a__if(false, X, Y) → mark(Y)
mark(minus(X1, X2)) → a__minus(X1, X2)
mark(geq(X1, X2)) → a__geq(X1, X2)
mark(div(X1, X2)) → a__div(mark(X1), X2)
mark(if(X1, X2, X3)) → a__if(mark(X1), X2, X3)
mark(0') → 0'
mark(s(X)) → s(mark(X))
mark(true) → true
mark(false) → false
a__minus(X1, X2) → minus(X1, X2)
a__geq(X1, X2) → geq(X1, X2)
a__div(X1, X2) → div(X1, X2)
a__if(X1, X2, X3) → if(X1, X2, X3)

Types:
a__minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
0' :: 0':s:true:false:minus:div:geq:if
s :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
true :: 0':s:true:false:minus:div:geq:if
false :: 0':s:true:false:minus:div:geq:if
a__div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
mark :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
hole_0':s:true:false:minus:div:geq:if1_0 :: 0':s:true:false:minus:div:geq:if
gen_0':s:true:false:minus:div:geq:if2_0 :: Nat → 0':s:true:false:minus:div:geq:if

Lemmas:
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(n4_0), gen_0':s:true:false:minus:div:geq:if2_0(n4_0)) → gen_0':s:true:false:minus:div:geq:if2_0(0), rt ∈ Ω(1 + n4₀)
a__geq(gen_0':s:true:false:minus:div:geq:if2_0(n491_0), gen_0':s:true:false:minus:div:geq:if2_0(n491_0)) → true, rt ∈ Ω(1 + n491₀)

Generator Equations:
gen_0':s:true:false:minus:div:geq:if2_0(0) ⇔ 0'
gen_0':s:true:false:minus:div:geq:if2_0(+(x, 1)) ⇔ s(gen_0':s:true:false:minus:div:geq:if2_0(x))

No more defined symbols left to analyse.

(24) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(n4_0), gen_0':s:true:false:minus:div:geq:if2_0(n4_0)) → gen_0':s:true:false:minus:div:geq:if2_0(0), rt ∈ Ω(1 + n4₀)

(25) BOUNDS(n^1, INF)

(26) Obligation:

TRS:
Rules:
a__minus(0', Y) → 0'
a__minus(s(X), s(Y)) → a__minus(X, Y)
a__geq(X, 0') → true
a__geq(0', s(Y)) → false
a__geq(s(X), s(Y)) → a__geq(X, Y)
a__div(0', s(Y)) → 0'
a__div(s(X), s(Y)) → a__if(a__geq(X, Y), s(div(minus(X, Y), s(Y))), 0')
a__if(true, X, Y) → mark(X)
a__if(false, X, Y) → mark(Y)
mark(minus(X1, X2)) → a__minus(X1, X2)
mark(geq(X1, X2)) → a__geq(X1, X2)
mark(div(X1, X2)) → a__div(mark(X1), X2)
mark(if(X1, X2, X3)) → a__if(mark(X1), X2, X3)
mark(0') → 0'
mark(s(X)) → s(mark(X))
mark(true) → true
mark(false) → false
a__minus(X1, X2) → minus(X1, X2)
a__geq(X1, X2) → geq(X1, X2)
a__div(X1, X2) → div(X1, X2)
a__if(X1, X2, X3) → if(X1, X2, X3)

Types:
a__minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
0' :: 0':s:true:false:minus:div:geq:if
s :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
true :: 0':s:true:false:minus:div:geq:if
false :: 0':s:true:false:minus:div:geq:if
a__div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
a__if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
div :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
minus :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
mark :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
geq :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
if :: 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if → 0':s:true:false:minus:div:geq:if
hole_0':s:true:false:minus:div:geq:if1_0 :: 0':s:true:false:minus:div:geq:if
gen_0':s:true:false:minus:div:geq:if2_0 :: Nat → 0':s:true:false:minus:div:geq:if

Lemmas:
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(n4_0), gen_0':s:true:false:minus:div:geq:if2_0(n4_0)) → gen_0':s:true:false:minus:div:geq:if2_0(0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s:true:false:minus:div:geq:if2_0(0) ⇔ 0'
gen_0':s:true:false:minus:div:geq:if2_0(+(x, 1)) ⇔ s(gen_0':s:true:false:minus:div:geq:if2_0(x))

No more defined symbols left to analyse.

(27) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
a__minus(gen_0':s:true:false:minus:div:geq:if2_0(n4_0), gen_0':s:true:false:minus:div:geq:if2_0(n4_0)) → gen_0':s:true:false:minus:div:geq:if2_0(0), rt ∈ Ω(1 + n4₀)

(28) BOUNDS(n^1, INF)